KERALA UNIVERSITY Class 6 formal languages and automata theoery Question Paper 2019

Practice authentic previous year questions for better exam preparation.

Sample Questions

What are offline Turing machines? ( $\mathbf{1 0} \boldsymbol{\times} \mathbf{4} \boldsymbol{=} \mathbf{4 0}$ Marks) P.T.O. Answer any one full questions from each Module. Each question carries 20 marks.
What are Mealy machines?
Reduce the regular expression $(00+0+1)^{*}$.
What is a decision algorithm?
List down the applications of finite automata.